home *** CD-ROM | disk | FTP | other *** search
- # Source Generated with Decompyle++
- # File: in.pyo (Python 2.4)
-
- import unittest
- import random
- import time
- import pickle
- import warnings
- from math import log, exp, sqrt, pi
- from test import test_support
-
- class TestBasicOps(unittest.TestCase):
-
- def randomlist(self, n):
- '''Helper function to make a list of random numbers'''
- return [ self.gen.random() for i in xrange(n) ]
-
-
- def test_autoseed(self):
- self.gen.seed()
- state1 = self.gen.getstate()
- time.sleep(0.10000000000000001)
- self.gen.seed()
- state2 = self.gen.getstate()
- self.assertNotEqual(state1, state2)
-
-
- def test_saverestore(self):
- N = 1000
- self.gen.seed()
- state = self.gen.getstate()
- randseq = self.randomlist(N)
- self.gen.setstate(state)
- self.assertEqual(randseq, self.randomlist(N))
-
-
- def test_seedargs(self):
- for arg in [
- None,
- 0,
- 0x0L,
- 1,
- 0x1L,
- -1,
- -0x1L,
- 10 ** 20,
- -10 ** 20,
- 3.1400000000000001,
- 1 + (0.0+2.0j),
- 'a',
- tuple('abc')]:
- self.gen.seed(arg)
-
- for arg in [
- range(3),
- dict(one = 1)]:
- self.assertRaises(TypeError, self.gen.seed, arg)
-
- self.assertRaises(TypeError, self.gen.seed, 1, 2)
- self.assertRaises(TypeError, type(self.gen), [])
-
-
- def test_jumpahead(self):
- self.gen.seed()
- state1 = self.gen.getstate()
- self.gen.jumpahead(100)
- state2 = self.gen.getstate()
- self.assertNotEqual(state1, state2)
- self.gen.jumpahead(100)
- state3 = self.gen.getstate()
- self.assertNotEqual(state2, state3)
- self.assertRaises(TypeError, self.gen.jumpahead)
- self.assertRaises(TypeError, self.gen.jumpahead, 'ick')
- self.assertRaises(TypeError, self.gen.jumpahead, 2.2999999999999998)
- self.assertRaises(TypeError, self.gen.jumpahead, 2, 3)
-
-
- def test_sample(self):
- N = 100
- population = xrange(N)
- for k in xrange(N + 1):
- s = self.gen.sample(population, k)
- self.assertEqual(len(s), k)
- uniq = set(s)
- self.assertEqual(len(uniq), k)
- self.failUnless(uniq <= set(population))
-
- self.assertEqual(self.gen.sample([], 0), [])
-
-
- def test_sample_distribution(self):
- n = 5
- pop = range(n)
- trials = 10000
-
- def factorial(n):
- return reduce(int.__mul__, xrange(1, n), 1)
-
- for k in xrange(n):
- expected = factorial(n) // factorial(n - k)
- perms = { }
- for i in xrange(trials):
- perms[tuple(self.gen.sample(pop, k))] = None
- if len(perms) == expected:
- break
- continue
-
-
-
-
- def test_sample_inputs(self):
- self.gen.sample(set(range(20)), 2)
- self.gen.sample(range(20), 2)
- self.gen.sample(xrange(20), 2)
- self.gen.sample(dict.fromkeys('abcdefghijklmnopqrst'), 2)
- self.gen.sample(str('abcdefghijklmnopqrst'), 2)
- self.gen.sample(tuple('abcdefghijklmnopqrst'), 2)
-
-
- def test_gauss(self):
- for seed in (1, 12, 123, 1234, 12345, 123456, 654321):
- self.gen.seed(seed)
- x1 = self.gen.random()
- y1 = self.gen.gauss(0, 1)
- self.gen.seed(seed)
- x2 = self.gen.random()
- y2 = self.gen.gauss(0, 1)
- self.assertEqual(x1, x2)
- self.assertEqual(y1, y2)
-
-
-
- def test_pickling(self):
- state = pickle.dumps(self.gen)
- origseq = [ self.gen.random() for i in xrange(10) ]
- newgen = pickle.loads(state)
- restoredseq = [ newgen.random() for i in xrange(10) ]
- self.assertEqual(origseq, restoredseq)
-
-
-
- class WichmannHill_TestBasicOps(TestBasicOps):
- gen = random.WichmannHill()
-
- def test_setstate_first_arg(self):
- self.assertRaises(ValueError, self.gen.setstate, (2, None, None))
-
-
- def test_strong_jumpahead(self):
- N = 1000
- s = self.gen.getstate()
- self.gen.jumpahead(N)
- r1 = self.gen.random()
- self.gen.setstate(s)
- for i in xrange(N):
- self.gen.random()
-
- r2 = self.gen.random()
- self.assertEqual(r1, r2)
-
-
- def test_gauss_with_whseed(self):
- for seed in (1, 12, 123, 1234, 12345, 123456, 654321):
- self.gen.whseed(seed)
- x1 = self.gen.random()
- y1 = self.gen.gauss(0, 1)
- self.gen.whseed(seed)
- x2 = self.gen.random()
- y2 = self.gen.gauss(0, 1)
- self.assertEqual(x1, x2)
- self.assertEqual(y1, y2)
-
-
-
- def test_bigrand(self):
- oldfilters = warnings.filters[:]
- warnings.filterwarnings('error', 'Underlying random')
- self.assertRaises(UserWarning, self.gen.randrange, 2 ** 60)
- warnings.filters[:] = oldfilters
-
-
-
- class SystemRandom_TestBasicOps(TestBasicOps):
- gen = random.SystemRandom()
-
- def test_autoseed(self):
- self.gen.seed()
-
-
- def test_saverestore(self):
- self.assertRaises(NotImplementedError, self.gen.getstate)
- self.assertRaises(NotImplementedError, self.gen.setstate, None)
-
-
- def test_seedargs(self):
- self.gen.seed(100)
-
-
- def test_jumpahead(self):
- self.gen.jumpahead(100)
-
-
- def test_gauss(self):
- self.gen.gauss_next = None
- self.gen.seed(100)
- self.assertEqual(self.gen.gauss_next, None)
-
-
- def test_pickling(self):
- self.assertRaises(NotImplementedError, pickle.dumps, self.gen)
-
-
- def test_53_bits_per_float(self):
- span = 2 ** 53
- cum = 0
- for i in xrange(100):
- cum |= int(self.gen.random() * span)
-
- self.assertEqual(cum, span - 1)
-
-
- def test_bigrand(self):
- span = 2 ** 500
- cum = 0
- for i in xrange(100):
- r = self.gen.randrange(span)
- None(self.assert_ if r <= r else r < span)
- cum |= r
-
- self.assertEqual(cum, span - 1)
-
-
- def test_bigrand_ranges(self):
- for i in [
- 40,
- 80,
- 160,
- 200,
- 211,
- 250,
- 375,
- 512,
- 550]:
- start = self.gen.randrange(2 ** i)
- stop = self.gen.randrange(2 ** (i - 2))
- if stop <= start:
- return None
-
- None(self.assert_ if self.gen.randrange(start, stop) <= self.gen.randrange(start, stop) else self.gen.randrange(start, stop) < stop)
-
-
-
- def test_rangelimits(self):
- for start, stop in [
- (-2, 0),
- (-2 ** 60 - 2, -2 ** 60),
- (2 ** 60, 2 ** 60 + 2)]:
- set([], []([ self.gen.randrange(start, stop) for i in xrange(100) ]))
-
-
-
- def test_genrandbits(self):
- for k in xrange(1, 1000):
- None(self.assert_ if self.gen.getrandbits(k) <= self.gen.getrandbits(k) else self.gen.getrandbits(k) < 2 ** k)
-
- getbits = self.gen.getrandbits
- for span in [
- 1,
- 2,
- 3,
- 4,
- 31,
- 32,
- 32,
- 52,
- 53,
- 54,
- 119,
- 127,
- 128,
- 129]:
- cum = 0
- for i in xrange(100):
- cum |= getbits(span)
-
- self.assertEqual(cum, 2 ** span - 1)
-
- self.assertRaises(TypeError, self.gen.getrandbits)
- self.assertRaises(TypeError, self.gen.getrandbits, 1, 2)
- self.assertRaises(ValueError, self.gen.getrandbits, 0)
- self.assertRaises(ValueError, self.gen.getrandbits, -1)
- self.assertRaises(TypeError, self.gen.getrandbits, 10.1)
-
-
- def test_randbelow_logic(self, _log = log, int = int):
- for i in xrange(1, 1000):
- n = 0x1L << i
- numbits = i + 1
- k = int(1.0000100000000001 + _log(n, 2))
- self.assertEqual(k, numbits)
- self.assert_(n == 2 ** (k - 1))
- n += n - 1
- k = int(1.0000100000000001 + _log(n, 2))
- self.assert_(k in [
- numbits,
- numbits + 1])
- None(self.assert_ if n > n else n > 2 ** (k - 2))
- n -= n >> 15
- k = int(1.0000100000000001 + _log(n, 2))
- self.assertEqual(k, numbits)
- None(self.assert_ if n > n else n > 2 ** (k - 1))
-
-
-
-
- class MersenneTwister_TestBasicOps(TestBasicOps):
- gen = random.Random()
-
- def test_setstate_first_arg(self):
- self.assertRaises(ValueError, self.gen.setstate, (1, None, None))
-
-
- def test_setstate_middle_arg(self):
- self.assertRaises(TypeError, self.gen.setstate, (2, None, None))
- self.assertRaises(ValueError, self.gen.setstate, (2, (1, 2, 3), None))
- self.assertRaises(TypeError, self.gen.setstate, (2, ('a',) * 625, None))
- self.assertRaises(TypeError, self.gen.setstate, (2, (0,) * 624 + ('a',), None))
-
-
- def test_referenceImplementation(self):
- expected = [
- 0.45839803073713259,
- 0.86057815201978782,
- 0.92848331726782152,
- 0.35932681119782461,
- 0.081823493762449573,
- 0.14332226470169329,
- 0.084297823823520024,
- 0.53814864671831453,
- 0.089215024911993401,
- 0.78486196105372907]
- self.gen.seed(0xF123L + (0x6147L << 32) + (0x266L << 64) + (0xA49FL << 96))
- actual = self.randomlist(2000)[-10:]
- for a, e in zip(actual, expected):
- self.assertAlmostEqual(a, e, places = 14)
-
-
-
- def test_strong_reference_implementation(self):
- ldexp = ldexp
- import math
- expected = [
- 0xEAB3258D2231FL,
- 0x1B89DB315277A5L,
- 0x1DB622A5518016L,
- 0xB7F9AF0D575BFL,
- 0x29E4C4DB82240L,
- 0x4961892F5D673L,
- 0x2B291598E4589L,
- 0x11388382C15694L,
- 0x2DAD977C9E1FEL,
- 0x191D96D4D334C6L]
- self.gen.seed(0xF123L + (0x6147L << 32) + (0x266L << 64) + (0xA49FL << 96))
- actual = self.randomlist(2000)[-10:]
- for a, e in zip(actual, expected):
- self.assertEqual(long(ldexp(a, 53)), e)
-
-
-
- def test_long_seed(self):
- seed = (0x1L << 10000 * 8) - 1
- self.gen.seed(seed)
-
-
- def test_53_bits_per_float(self):
- span = 2 ** 53
- cum = 0
- for i in xrange(100):
- cum |= int(self.gen.random() * span)
-
- self.assertEqual(cum, span - 1)
-
-
- def test_bigrand(self):
- span = 2 ** 500
- cum = 0
- for i in xrange(100):
- r = self.gen.randrange(span)
- None(self.assert_ if r <= r else r < span)
- cum |= r
-
- self.assertEqual(cum, span - 1)
-
-
- def test_bigrand_ranges(self):
- for i in [
- 40,
- 80,
- 160,
- 200,
- 211,
- 250,
- 375,
- 512,
- 550]:
- start = self.gen.randrange(2 ** i)
- stop = self.gen.randrange(2 ** (i - 2))
- if stop <= start:
- return None
-
- None(self.assert_ if self.gen.randrange(start, stop) <= self.gen.randrange(start, stop) else self.gen.randrange(start, stop) < stop)
-
-
-
- def test_rangelimits(self):
- for start, stop in [
- (-2, 0),
- (-2 ** 60 - 2, -2 ** 60),
- (2 ** 60, 2 ** 60 + 2)]:
- set([], []([ self.gen.randrange(start, stop) for i in xrange(100) ]))
-
-
-
- def test_genrandbits(self):
- self.gen.seed(1234567)
- self.assertEqual(self.gen.getrandbits(100), 0x13C58FD846EC5C07FF6908E53L)
- for k in xrange(1, 1000):
- None(self.assert_ if self.gen.getrandbits(k) <= self.gen.getrandbits(k) else self.gen.getrandbits(k) < 2 ** k)
-
- getbits = self.gen.getrandbits
- for span in [
- 1,
- 2,
- 3,
- 4,
- 31,
- 32,
- 32,
- 52,
- 53,
- 54,
- 119,
- 127,
- 128,
- 129]:
- cum = 0
- for i in xrange(100):
- cum |= getbits(span)
-
- self.assertEqual(cum, 2 ** span - 1)
-
- self.assertRaises(TypeError, self.gen.getrandbits)
- self.assertRaises(TypeError, self.gen.getrandbits, 'a')
- self.assertRaises(TypeError, self.gen.getrandbits, 1, 2)
- self.assertRaises(ValueError, self.gen.getrandbits, 0)
- self.assertRaises(ValueError, self.gen.getrandbits, -1)
-
-
- def test_randbelow_logic(self, _log = log, int = int):
- for i in xrange(1, 1000):
- n = 0x1L << i
- numbits = i + 1
- k = int(1.0000100000000001 + _log(n, 2))
- self.assertEqual(k, numbits)
- self.assert_(n == 2 ** (k - 1))
- n += n - 1
- k = int(1.0000100000000001 + _log(n, 2))
- self.assert_(k in [
- numbits,
- numbits + 1])
- None(self.assert_ if n > n else n > 2 ** (k - 2))
- n -= n >> 15
- k = int(1.0000100000000001 + _log(n, 2))
- self.assertEqual(k, numbits)
- None(self.assert_ if n > n else n > 2 ** (k - 1))
-
-
-
- _gammacoeff = (0.99999999999951827, 676.52036812188351, -1259.1392167222889, 771.32342877576741, -176.61502914983859, 12.50734324009056, -0.1385710331296526, 9.9349371139307475e-06, 1.6594701874084621e-07)
-
- def gamma(z, cof = _gammacoeff, g = 7):
- z -= 1.0
- sum = cof[0]
- for i in xrange(1, len(cof)):
- sum += cof[i] / (z + i)
-
- z += 0.5
- return ((z + g) ** z / exp(z + g)) * sqrt(2 * pi) * sum
-
-
- class TestDistributions(unittest.TestCase):
-
- def test_zeroinputs(self):
- g = random.Random()
- x = [ g.random() for i in xrange(50) ] + [
- 0.0] * 5
- g.random = x[:].pop
- g.uniform(1, 10)
- g.random = x[:].pop
- g.paretovariate(1.0)
- g.random = x[:].pop
- g.expovariate(1.0)
- g.random = x[:].pop
- g.weibullvariate(1.0, 1.0)
- g.random = x[:].pop
- g.normalvariate(0.0, 1.0)
- g.random = x[:].pop
- g.gauss(0.0, 1.0)
- g.random = x[:].pop
- g.lognormvariate(0.0, 1.0)
- g.random = x[:].pop
- g.vonmisesvariate(0.0, 1.0)
- g.random = x[:].pop
- g.gammavariate(0.01, 1.0)
- g.random = x[:].pop
- g.gammavariate(1.0, 1.0)
- g.random = x[:].pop
- g.gammavariate(200.0, 1.0)
- g.random = x[:].pop
- g.betavariate(3.0, 3.0)
-
-
- def test_avg_std(self):
- g = random.Random()
- N = 5000
- x = [ i / float(N) for i in xrange(1, N) ]
- for variate, args, mu, sigmasqrd in [
- (g.uniform, (1.0, 10.0), (10.0 + 1.0) / 2, (10.0 - 1.0) ** 2 / 12),
- (g.expovariate, (1.5,), 1 / 1.5, 1 / 1.5 ** 2),
- (g.paretovariate, (5.0,), 5.0 / (5.0 - 1), 5.0 / ((5.0 - 1) ** 2 * (5.0 - 2))),
- (g.weibullvariate, (1.0, 3.0), gamma(1 + 1 / 3.0), gamma(1 + 2 / 3.0) - gamma(1 + 1 / 3.0) ** 2)]:
- g.random = x[:].pop
- y = []
- for i in xrange(len(x)):
-
- try:
- y.append(variate(*args))
- continue
- except IndexError:
- []
- []
- []
- continue
-
-
-
- for e in y:
- s1 += e
- s2 += (e - mu) ** 2
-
- N = len(y)
- self.assertAlmostEqual(s1 / N, mu, 2)
- self.assertAlmostEqual(s2 / (N - 1), sigmasqrd, 2)
-
-
-
-
- class TestModule(unittest.TestCase):
-
- def testMagicConstants(self):
- self.assertAlmostEqual(random.NV_MAGICCONST, 1.71552776992141)
- self.assertAlmostEqual(random.TWOPI, 6.2831853071800001)
- self.assertAlmostEqual(random.LOG4, 1.3862943611198899)
- self.assertAlmostEqual(random.SG_MAGICCONST, 2.5040773967762702)
-
-
- def test__all__(self):
- self.failUnless(set(random.__all__) <= set(dir(random)))
-
-
-
- def test_main(verbose = None):
- testclasses = [
- WichmannHill_TestBasicOps,
- MersenneTwister_TestBasicOps,
- TestDistributions,
- TestModule]
-
- try:
- random.SystemRandom().random()
- except NotImplementedError:
- pass
-
- testclasses.append(SystemRandom_TestBasicOps)
- test_support.run_unittest(*testclasses)
- import sys
- if verbose and hasattr(sys, 'gettotalrefcount'):
- counts = [
- None] * 5
- for i in xrange(len(counts)):
- test_support.run_unittest(*testclasses)
- counts[i] = sys.gettotalrefcount()
-
- print counts
-
-
- if __name__ == '__main__':
- test_main(verbose = True)
-
-